منابع مشابه
Tree-Automatic Well-Founded Trees
We investigate tree-automatic well-founded trees. Using Delhommé’s decomposition technique for tree-automatic structures, we show that the (ordinal) rank of a tree-automatic well-founded tree is strictly below ω. Moreover, we make a step towards proving that the ranks of tree-automatic well-founded partial orders are bounded by ω ω : we prove this bound for what we call upwards linear partial o...
متن کاملNon-well-founded trees in categories
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data structures. Categorically, they arise as final coalgebras for polynomial endofunctors, which we call M-types. We derive existence results for M-types in locally cartesian closed pretoposes with a natural numbers object, using their inter...
متن کاملAutomatic Finite Unfolding Using Well-Founded Measures
t> We elaborate on earlier work proposing general criteria to control unfolding during partial deduction of logic programs. We study several techniques relying on more general and more powerful well-founded orderings. In particular, we extend our framework to incorporate lexicographical priorities between argument positions in a goal. We show that this handles some remaining deficiencies in pre...
متن کاملA non-well-founded primitive recursive tree provably well-founded for co-r.e. sets
We construct by diagonalization a non-well-founded primitive recursive tree, which is well-founded for co-r.e. sets, provable in Σ01-IND. It follows that the supremum of order-types of primitive recursive wellorderings, whose well-foundedness on co-r.e. sets is provable in Σ01-IND, equals the limit of all recursive ordinals ω 1 . This work contributes to the investigation of replacing the quant...
متن کاملUniforming n-place Functions on Well Founded Trees
In this paper the Erdős-Rado theorem is generalized to the class of well founded trees. We define an equivalence relation on the class ds(∞)0 ( finite sequences of decreasing sequences of ordinals) with א0 equivalence classes, and for n < ω a notion of n-end-uniformity for a colouring of ds(∞)0 with μ colours. We then show that for every ordinal α, n < ω and cardinal μ there is an ordinal λ so ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2013
ISSN: 1860-5974
DOI: 10.2168/lmcs-9(2:10)2013